Improving RSS-Based Indoor Positioning Algorithm via K-Means Clustering

نویسندگان

  • Bulut Altintas
  • Tacha Serif
چکیده

Advances in mobile technologies and devices has changed the way users interact with devices and other users. These new interaction methods and services are offered by the help of intelligent sensing capabilities, using context, location and motion sensors. However, indoor location sensing is mostly achieved by utilizing radio signal (Wi-Fi, Bluetooth, GSM etc.) and nearest neighbor identification. The most common algorithm adopted for Received Signal Strength (RSS)-based location sensing is K Nearest Neighbor (KNN), which calculates K nearest neighboring points to mobile users (MUs). Accordingly, in this paper, we aim to improve the KNN algorithm by enhancing the neighboring point selection by applying k-means clustering approach. In the proposed method, k-means clustering algorithm groups nearest neighbors according to their distance to mobile user. Then the closest group to the mobile user is used to calculate the MU's location. The evaluation results indicate that the performance of clustered KNN is closely tied to the number of clusters, number of neighbors to be clustered and the initiation of the center points in k-mean algorithm. Keywords-component; Received signal strength, k-Means, clustering, location estimation, personal digital assistant (PDA), wireless, indoor positioning

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coordinate-Based Clustering Method for Indoor Fingerprinting Localization in Dense Cluttered Environments

Indoor positioning technologies has boomed recently because of the growing commercial interest in indoor location-based service (ILBS). Due to the absence of satellite signal in Global Navigation Satellite System (GNSS), various technologies have been proposed for indoor applications. Among them, Wi-Fi fingerprinting has been attracting much interest from researchers because of its pervasive de...

متن کامل

Indoor Location in WLAN Based on Competitive Agglomeration Algorithm

In the area of Wireless Local Area Network (WLAN) based indoor localization, the k-nearest neighbors (KNN) fusion clustering algorithm has been studied extensively. But the number of the clustering and the value of K is set manually and fixed, so it can’t adapt to the environment changes. Besides, the algorithm localization with a single Received Signal Strength (RSS), and ignored other deeper ...

متن کامل

An Improved Indoor Positioning Method Based on Affinity Propagation Clustering

The fingerprint-based wireless local area network (WLAN) positioning has gained significant interest in recent years. Indoor localization methods based on WLAN and RSS with advantage of low cost are most widely used. In this paper, we propose an improved indoor positioning method based on Affinity Propagation (AP) algorithm to obtain better accuracy: k coordinate points measured through KNN alg...

متن کامل

An RFID Indoor Positioning Algorithm Based on Bayesian Probability and K-Nearest Neighbor

The Global Positioning System (GPS) is widely used in outdoor environmental positioning. However, GPS cannot support indoor positioning because there is no signal for positioning in an indoor environment. Nowadays, there are many situations which require indoor positioning, such as searching for a book in a library, looking for luggage in an airport, emergence navigation for fire alarms, robot ...

متن کامل

Indoor Positioning and Pre-processing of RSS Measurements

Rapid expansions of new location-based services signify the need for finding accurate localization techniques for indoor environments. Among different techniques, RSS-based  schemes and in particular oneof its variants which is based on Graph-based Semi-Supervised Learning (G-SSL) are widely-used approaches The superiority of this scheme is that it has low setup/training cost and at the same ti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011